Derandomizing Arthur-Merlin Games
نویسنده
چکیده
We establish hardness versus randomness trade-oos for Arthur-Merlin games. We create eecient nondeterministic simulations of bounded round Arthur-Merlin games, using a language in exponential time which small circuits cannot decide given access to an oracle for satissability. Our results yield subexponential size proofs for graph nonisomorphism at innnitely many lengths unless the polynomial-time hierarchy collapses. The same holds for any other language with a bounded round interactive proof system. We also apply our techniques to related complexity classes.
منابع مشابه
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into P implies linear-exponential circuit lower bounds for E. Our proof is simpler and yields stronger results. In particular, consider the promise-AM problem of distinguishing between the case where a given Boolean circuit C accepts at least a given number b of inputs, and the cas...
متن کاملGeneralized Quantum Arthur-Merlin Games
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the present work introduces a generalized version of quantum Arthur-Merlin games where the public coins can be quantum as well: the verifier can send not only random ...
متن کاملArthur-Merlin Games in Boolean Decision Trees
It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...
متن کاملLower Bounds for Swapping
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time Ω(t) to black-box simulate MA-games running in time t. Thus, the known simulations of MA by AM with quadratic overhead, dating back to Babai’s original paper on Arthur-Merlin games, are tight within this setting. The black-...
متن کاملQuadratic Simulations of Merlin-Arthur Games
The known proofs of MA ⊆ PP incur a quadratic overhead in the running time. We prove that this quadratic overhead is necessary for black-box simulations; in particular, we obtain an oracle relative to which MA-TIME(t) 6⊆ P-TIME(o(t)). We also show that 2-sided-error Merlin– Arthur games can be simulated by 1-sided-error Arthur–Merlin games with quadratic overhead. We also present a simple, quer...
متن کامل